Ambiguous Solicitation: Ambiguous Prescription

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ambiguous Solicitation: Ambiguous Prescription

We conduct a two-phase laboratory experiment, separated by several weeks. In the first phase, we conduct urn games intended to measure ambiguity aversion on a representative population of undergraduate students. In the second phase, we invite the students back with four different solicitation treatments, varying in the ambiguity of information regarding the task and the payout of the laboratory...

متن کامل

Do Ambiguous Reconstructions Always Give Ambiguous Images?

In many cases self-calibration is not able to yield a unique solution for the 3D reconstruction of a scene. This is due to the occurrence of critical motion sequences. If this is the case, an ambiguity is left on the reconstruction. In this paper it is derived under which conditions correct novel views can be generated from ambiguous reconstructions. The problem is first approached from a theor...

متن کامل

Ambiguous Environments

Cover Page Footnote: This paper was given as Invited Lecture at ICA 1994. It was published in 1995 in Threatened Peoples and Environments in the Americas, Proceedings of the 48th International Congress of Americanists, M. Marner and M. Rosendahl (eds), pp. 39-49, Stockholm: Institute of Latin American Studies. Not only is this publication out of print and very difficult to find, but the theme o...

متن کامل

Ambiguous Persuasion ∗

We study a persuasion game à la Kamenica and Gentzkow (2011) where players are ambiguity averse with maxmin expected utility (Gilboa and Schmeidler, 1989). With no prior ambiguity, Sender might choose to use ambiguous communication devices. The main result characterizes the value of optimal ambiguous persuasion, which is often higher than what is feasible under Bayesian persuasion. We character...

متن کامل

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

We resolve an open problem raised by Ravikumar and Ibarra [SIAM J. Comput., 18 (1989), pp. 1263–1282] on the succinctness of representations relating to the types of ambiguity of finite automata. We show that there exists a family of nondeterministic finite automata {An} over a two-letter alphabet such that, for any positive integer n, An is exponentially ambiguous and has n states, whereas the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2009

ISSN: 1556-5068

DOI: 10.2139/ssrn.1371645